k-connected graph
英 [keɪ kəˈnektɪd ɡræf]
美 [keɪ kəˈnektɪd ɡræf]
网络 连通图
双语例句
- The Augmentation Problem of a Directed Tree Graph to a K-Connected Graph
有向树图的最小K点连通扩充 - In Chapter 3, we prove that: Suppose G is a k-connected weighted graph which satisfies the following conditions: ( 1) The weighted degree sum of any k+ 1 pairwise nonadjacent vertices is at least m;
在第三章里，我们证明了：假设G是一个满足k≥2的k连通赋权图。如果G满足以下条件：（1）任意k+1个相互独立的顶点的赋权度和至少为m； - The optimization problem of constructing k-connected graph from any undirected tree by adding a minimum set of edges is studied. An efficient algorithm with complexity of O (| V|~ 4) is presented.
解决了以最少边集扩充一个任意无向树图为k点连通图这一优化问题，提出了一个计算复杂度为D（V~4）的算法。 - Let C be a Longest cycle in a k-connected graph G and let H be a component of G-C.
设C是k-连通图G（2≤k≤6）的一个最长圈.H是G-C的一个分支。